Immersions in Highly Edge Connected Graphs
نویسندگان
چکیده
منابع مشابه
On spanning tree packings of highly edge connected graphs
We prove a refinement of the tree packing theorem by Tutte/Nash-Williams for finite graphs. This result is used to obtain a similar result for end faithful spanning tree packings in certain infinite graphs and consequently to establish a sufficient Hamiltonicity condition for the line graphs of such graphs.
متن کاملDecomposing highly edge-connected graphs into trees of small diameter
The Tree Decomposition Conjecture by Bárat and Thomassen states that for every tree T there exists a natural number k(T ) such that the following holds: If G is a k(T )-edge-connected simple graph with size divisible by the size of T , then G can be edge-decomposed into subgraphs isomorphic to T . The results on modulo k-orientations by Thomassen show that the Tree Decomposition Conjecture hold...
متن کاملHighly edge-connected detachments of graphs and digraphs
Let G = (V, E) be a graph or digraph and r : V → Z+. An r-detachment of G is a graph H obtained by ‘splitting’ each vertex v ∈ V into r(v) vertices. The vertices v1, ..., vr(v) obtained by splitting v are called the pieces of v in H. Every edge uv ∈ E corresponds to an edge of H connecting some piece of u to some piece of v. Crispin Nash-Williams [9] gave necessary and sufficient conditions for...
متن کاملGenerating connected and 2-edge connected graphs
We focus on the algorithm underlying the main result of [6]. This is an algebraic formula to generate all connected graphs in a recursive and efficient manner. The key feature is that each graph carries a scalar factor given by the inverse of the order of its group of automorphisms. In the present paper, we revise that algorithm on the level of graphs. Moreover, we extend the result subsequentl...
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2014
ISSN: 0895-4801,1095-7146
DOI: 10.1137/130924056